The Odds of Eternal Optimization in Optimality Theory
نویسنده
چکیده
The first part of this paper shows that a non-teleological account of sound change is possible if we assume two things: first, that Optimality-Theoretic constraints that do not contribute to determining the winning candidate are ranked randomly with respect to each other, i.e. differently for every speaker; second, that learners acquire as their underlying representations the forms that they detect most often in their environment. The resulting variation-and-selection scheme can be regarded as locally optimizing. It is shown, however, that it is possible that a sequence of such optimizing sound changes ends up in a loop rather than in a single absorbing final state. This kind of cyclic optimization is shown to be exactly what happened in the attested and reconstructed changes in the Indo-European consonant systems. The second part of this paper presents a simulation that shows that cyclic optimization is not only possible but also rather likely: twenty percent of all inventories are in an optimizing loop or heading towards one.
منابع مشابه
Control Theory and Economic Policy Optimization: The Origin, Achievements and the Fading Optimism from a Historical Standpoint
Economists were interested in economic stabilization policies as early as the 1930’s but the formal applications of stability theory from the classical control theory to economic analysis appeared in the early 1950’s when a number of control engineers actively collaborated with economists on economic stability and feedback mechanisms. The theory of optimal control resulting from the contributio...
متن کاملOptimality Of Monetary And Fiscal Policies In Iran: An Application Of The Stochastic Optimal Control Theory
متن کامل
Eternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002